Random number generation: A combinatorial approach
نویسندگان
چکیده
منابع مشابه
Random Number Generation 1
Universit e de Montr eal 2 4.1 INTRODUCTION Random numbers are the nuts and bolts of simulation. Typically, all the randomness required by the model is simulated by a random number generator whose output is assumed to be a sequence of independent and identically distributed (IID) U(0; 1) random variables (i.e., continuous random variables distributed uniformly over the interval (0; 1)). These r...
متن کاملRandom Number Generation
AI algorithms like genetic algorithms and automated opponents. Random game content and level generation. Simulation of complex phenomena such as weather and fire. Numerical methods such as Monte-Carlo integration. Until recently primality proving used randomized algorithms. Cryptography algorithms such as RSA use random numbers for key generation. Weather simulation and other stat...
متن کاملOn Random Number Generation
Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...
متن کاملA Combinatorial Approach to Positional Number Systems
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in the binary case digits 0 and 1. A binary positional number system (binary radix system) with base equal the golden ratio (1 + √ 5)/2 is fairly well known. The main result of this paper is a construction of infinitely many binary radix systems, each one construct...
متن کاملPoor performance of random random number generation
Knuth [Knu98] shows that iterations a random function perform poorly on average as a random number generator and proposes a generalization in which the next value depends on two or more previous values. This note demonstrates the equally poor performance of a random instance in this more general model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90115-3